A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
نویسندگان
چکیده
منابع مشابه
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably de ned customer improvement graph, and multi-customer multi-exchanges, detected...
متن کاملA Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
متن کاملA Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost
This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...
متن کاملA Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract)
We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+2 √ 2− 2 and 3+2√2+ 2 for any given constant 2 > 0....
متن کاملA computational study of dicut reformulation for the Single Source Capacitated Facility Location problem
The Capacitated Facility Location Problem is to locate a set of facilities with capacity constraints, with the aim of satisfying at the minimum cost the demands of a set of clients. The Single Source version (SingleCFLP ) of the problem has the additional requirement that each client must be assigned to a single facility. In this paper a reformulation of the problem based on Dicut Inequalities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.04.032